A Introduction to Pseudocode What is Pseudocode? An algorithm is a sequence of instructions to solve a well-formulated computational problem specified in terms of its input and output. An algorithm uses the input to gene

Source URL: bioinformaticsalgorithms.com

International Journal on Computational Science & Applications (IJCSA) Vol.5,No.6, DecemberBIN PACKING PROBLEM: A LINEAR CONSTANT
SPACE -APPROXIMATION ALGORITHM 

Source URL: wireilla.com

Logic, Computation and Constraint Satisfaction Barnaby D. Martin University of Leicester

Source URL: www.bedewell.com

• Computational complexity theory
• Logic
• Complexity classes
• Mathematical logic
• PSPACE
• FO
• Second-order logic
• P versus NP problem
• Constraint satisfaction problem
• NP
• P
• Constraint satisfaction

On Solving Boolean Multilevel Optimization Problems∗ Josep Argelich INESC-ID Lisbon

Source URL: www.mancoosi.org

• Theoretical computer science
• Mathematics
• Computational complexity theory
• Operations research
• Logic in computer science
• Mathematical optimization
• NP-complete problems
• Boolean algebra
• Maximum satisfiability problem
• Boolean satisfiability problem
• Constraint satisfaction
• Solver

Approximating Border Length for DNA Microarray Synthesis Cindy Y. Li1 Prudence W.H. Wong1 Qin Xin2 Fencol C.C. Yung3 1 3

Source URL: cgi.csc.liv.ac.uk

• Computational complexity theory
• Mathematics
• Dynamic programming
• Theory of computation
• IP
• Longest common subsequence problem

Complexity in Geometric SINR Olga Goussevskaia Yvonne Anne Oswald Roger Wattenhofer

Source URL: disco.ethz.ch

• Computational complexity theory
• Complexity classes
• NP-complete problems
• Operations research
• Combinatorial optimization
• Mathematical optimization
• Knapsack problem
• Reduction
• Graph coloring
• NP-hardness
• NP
• Optimization problem

TECHNISCHE UNIVERSITÄT WIEN Institut für Computergraphik und Algorithmen Load-Dependent and Precedence-Based Models for Pickup and Delivery Problems

Source URL: www.ads.tuwien.ac.at

• Graph theory
• Operations research
• Mathematics
• Computational complexity theory
• Network flow
• NP-complete problems
• NP-hard problems
• Travelling salesman problem
• Multi-commodity flow problem
• Flow network

Curriculum Vitae: Alexis C. Kaporis Contact information Address : Phone:

Source URL: students.ceid.upatras.gr

• Theoretical computer science
• Computational complexity theory
• Mathematics
• Logic in computer science
• NP-complete problems
• Boolean algebra
• Boolean satisfiability problem
• Electronic design automation
• Symposium on Discrete Algorithms
• Approximation algorithm
• Random walk
• 2-satisfiability

Kinetic Data Structures: Animating Proofs Through Time Julien Basch∗ Jo˜ao Comba† Leonidas J. Guibas‡ John Hershberger§ Craig D. Silverstein¶ Li Zhangk When motion begins, each certificate remains valid until th

Source URL: cs.smith.edu

• Computer science
• Geometry
• Computing
• Computational geometry
• Triangulation
• Delaunay triangulation
• Kinetic data structure
• John Hershberger
• Convex hull
• Voronoi diagram
• Leonidas J. Guibas
• Closest pair of points problem

Thursday 31 March EvoCOP 1 - Real World Applications, 11:30-13:10 Chaired by Francisco Chicano Particle Swarm Optimization for Multi-Objective Web Service Location Allocation,

Source URL: www.evostar.org

• Mathematics
• Operations research
• Computational complexity theory
• Applied mathematics
• Mathematical optimization
• NP-complete problems
• Cybernetics
• Heuristics
• Hyper-heuristic
• Genetic algorithm
• Travelling salesman problem
• Evolutionary algorithm